On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms
نویسندگان
چکیده
In this paper we study with a schema-theoretic approach and experiments the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are totally unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations where the population presents a statistically independent distribution of primitives. This is an important step towards generalising Geiringer’s theorem and the notion of linkage equilibrium, previously applied only to fixed-length representations.
منابع مشابه
Modeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملOn the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms
With a schema-theoretic approach and experiments we study the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations where the population pres...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملAllele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover
In this paper we study, theoretically, the search biases produced by GP subtree crossover when applied to linear representations, such as those used in linear GP or in variable length GAs. The study naturally leads to generalisations of Geiringer’s theorem and of the notion of linkage equilibrium, which, until now, were applicable only to fixed-length representations. This indicates the presenc...
متن کاملFew heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...
متن کامل